package wh.删除链表中重复元素;

import java.util.HashMap;
import java.util.Map;

/**
 * @author: wh(1835734390 @ qq.com)
 * @date: 2022/5/27 11:39
 * @description:
 * @version:
 */
public class Test {
        public static void main(String[] args) {
            long start = System.nanoTime();
            extracted(5000);
            long end = System.nanoTime();
            System.out.println(end-start);

        }

    private static void extracted(int test) {
        int[][] array = {{-300, 1000}, {-500, 1300}, {-700, 1500}, {-1000, 2000}, {-1500, 2500},
                {-2000, 2500}, {-2500, 3000}, {-3000, 4000}, {-3000, 3000}, {-2000, 2000}};
        int[] myData = {0, 3000, 5000, 15000, 30000, 50000, 70000, 90000, 110000, 150000};


        int j;
        for (j = 0; j < myData.length - 1; j++) {
            if (test < myData[j]) {
                break;
            }
        }

        int num1 = myData[j - 1];
        int num2 = myData[j];
//        System.out.println("jjjjjjjjjjjjj" + j);
        if (j == myData.length - 1) {
//            System.out.println("你输入的位次大于" + num2);
//            System.out.println("minRank ===" + (test - 2000));
//            System.out.println("maxRank ===" + (test + 2000));
        } else {
//            System.out.println("你输入的位次>" + num1 + "<" + num2);
//            int[] ints = array[j - 1];
//            System.out.println("minRank ===" + (test + ints[0]));
//            System.out.println("maxRank ===" + (test + ints[1]));
        }
    }



}
